Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs
نویسندگان
چکیده
منابع مشابه
Dominating 2-broadcast in Graphs: Complexity, Bounds and Extremal Graphs
Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating 2-broadcasts along with the associated parameter, the dominating 2-broadcast number. We prove that computing the dominating 2-broadcast number is a NP-complete problem, but can be achieved in linear time fo...
متن کاملDiscriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity
Consider an undirected bipartite graph G = (V = I ∪A,E), with no edge inside I nor A. For any vertex v ∈ V , let N(v) be the set of neighbours of v. A code C ⊆ A is said to be discriminating if all the sets N(i) ∩ C, i ∈ I, are nonempty and distinct. We study some properties of discriminating codes. In particular, we give bounds on the minimum size of these codes, investigate graphs where minim...
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملIncidence dominating numbers of graphs
In this paper, the concept of incidence domination number of graphs is introduced and the incidence dominating set and the incidence domination number of some particular graphs such as paths, cycles, wheels, complete graphs and stars are studied.
متن کاملExtremal cardinalities for identifying and locating-dominating codes in graphs
Consider a connected undirected graph G = (V ,E), a subset of vertices C ⊆ V , and an integer r 1; for any vertex v ∈ V , let Br(v) denote the ball of radius r centred at v, i.e., the set of all vertices linked to v by a path of at most r edges. If for all vertices v ∈ V (respectively, v ∈ V \C), the setsBr(v)∩C are all nonempty and different, then we call C an r-identifying code (respectively,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Analysis and Discrete Mathematics
سال: 2018
ISSN: 1452-8630,2406-100X
DOI: 10.2298/aadm1801205c